Static Partial Order Reduction
نویسندگان
چکیده
1 I n t r o d u c t i o n One c o m m o n me thod for dealing with the intrinsically intractable computa t iona l complexi ty of model-checking asynchronous systems is partial order reduction. This reduct ion technique exploits the c o m m o n practice of model ing concurrent events in asynchronous systems as an interleaving of the events in all possible execution orders. An impor t an t observation about such systems is tha t the properties one needs to check often do not distinguish among these different orders. The reduct ion a lgor i thm produces a state graph which contains only a subset of the s tates and transi t ions of the original system, but which contains enough informat ion about the modelled sys tem so tha t it is possible to apply model checking a lgor i thms to it instead of the full s tate graph. The verified proper ty is
منابع مشابه
Symbolic Partial Order Reduction for Rule Based Transition Systems
Partial order (PO) reduction methods are widely employed to combat state explosion during model-checking. We develop a partial order reduction algorithm for rule-based languages such as Murphi [4] based on the observation that for finite-state systems, independence conditions used for PO reduction can be encoded as boolean propositions and checked using SAT methods. Comparisons against static-a...
متن کاملStatic Partial-Order Reduction of Concurrent Systems in Polynomial Time
We present an algorithm for attacking the state explosion problem in analyzing multithreaded programs. Our approach employs partial-order reduction and static virtual coarsening. It uses information on shared variables to generate and interleave blocks of statements. Our algorithm performs polynomially as long as the number of shared variables is constant.
متن کاملStatic Partial Order Reductions for Probabilistic Systems
The present Master’s thesis seeks the development and analysis of static partial order reduction techniques for the models of probabilistic systems. The properties of those systems can be verified via model checking technique. Model checking suffers from the problem known as State Space Explosion, which can make the verification process intractable. Partial order reductions are aimed at allevia...
متن کاملCombining Static Analysis and Model Checking for Software Analysis
We present an iterative technique in which model checking and static analysis are combined to verify large software systems. The role of the static analysis is to compute partial order information which the model checker uses to reduce the state space. During exploration, the model checker also computes aliasing information that it gives to the static analyzer which can then refine its analysis...
متن کاملEnabling Efficient Partial Order Reductions for Model Checking Object-Oriented Programs Using Static Calculation of Program Dependences
In our previous work, we developed partial order reduction techniques that now form the core reduction strategies of several popular Java model checking frameworks including Bogor and JPF. These techniques work by dynamically collecting independence information needed to drive POR. In this paper, we consider several additional variants of partial order reductions and how independence informatio...
متن کاملHybrid Analysis for Partial Order Reduction of Programs with Arrays
An important component of efficient approaches to software model checking and systematic concurrency testing is partial order reduction, which eliminates redundant non-deterministic thread scheduling choices during the state space traversal. Thread choices have to be created only at the execution of actions that access the global state visible by multiple threads, so the key challenge is to pre...
متن کامل